ar X iv : 0 80 6 . 42 64 v 1 [ cs . I T ] 2 6 Ju n 20 08 Online network coding for optimal throughput and delay – the two - receiver case Jay
نویسندگان
چکیده
For a packet erasure broadcast channel with two receivers, a new coding algorithm is proposed that makes use of feedback to achieve asymptotically optimal queue size at the sender and decoding delay at the receivers, without compromising on throughput. Our coding module is compatible with the drop-when-seen queuing algorithm proposed in earlier work [1]. Hence, it guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom. In addition, the coding module is throughput optimal and at the same time, also achieves an asymptotically optimal decoding delay of O (
منابع مشابه
ar X iv : 0 80 6 . 42 64 v 2 [ cs . I T ] 2 9 Se p 20 08 Online network coding for optimal throughput and delay – the three - receiver case
For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an asymptotically optimal average decoding delay at the receivers. We consider heavy traffic asymptotics, where the load factor ρ approaches 1 from below with either t...
متن کاملar X iv : 0 80 6 . 27 64 v 1 [ m at h - ph ] 1 7 Ju n 20 08 Self - adjoint extensions of Coulomb systems in 1 , 2 and 3 dimensions
We study the nonrelativistic quantum Coulomb hamiltonian (i.e., inverse of distance potential) in Rn, n = 1, 2, 3. We characterize their self-adjoint extensions and, in the unidimensional case, present a discussion of controversies in the literature, particularly the question of the permeability of the origin. Potentials given by fundamental solutions of Laplace equation are also briefly consid...
متن کامل9 Se p 20 08 Online network coding for optimal throughput and delay – the three - receiver case Jay
For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an asymptotically optimal average decoding delay at the receivers. We consider heavy traffic asymptotics, where the load factor ρ approaches 1 from below with either t...
متن کاملar X iv : 0 80 6 . 46 34 v 1 [ he p - ex ] 3 0 Ju n 20 08 LPHE 2008 - 05 June 30 , 2008 B 0 – B 0 MIXING
متن کامل
ar X iv : 0 80 6 . 44 99 v 1 [ m at h . G N ] 2 7 Ju n 20 08 Aronszajn Compacta ∗
We consider a class of compacta X such that the maps from X onto metric compacta define an Aronszajn tree of closed subsets of X.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008